A discrete filled function algorithm for approximate global solutions of max-cut problems
نویسندگان
چکیده
منابع مشابه
An Effective Continuous Algorithm for Approximate Solutions of Large Scale Max-cut Problems
An effective continuous algorithm is proposed to find approximate solutions of NP-hard max-cut problems. The algorithm relaxes the max-cut problem into a continuous nonlinear programming problem by replacing n discrete constraints in the original problem with one single continuous constraint. A feasible direction method is designed to solve the resulting nonlinear programming problem. The metho...
متن کاملApproximate Max Cut
where S(n) is the n dimensional unit sphere in IR. This is an instance of semi-definite programming, which is a special case of convex programming, which can be solved in polynomial time (solved here means approximated within arbitrary constant in polynomial time). Observe that (P) is a relaxation of (Q), and as such the optimal solution of (P) has value larger than the optimal value of (Q). Th...
متن کاملDiscrete Filled Function Method for Discrete Global Optimization
A discrete filled function method is developed in this paper to solve discrete global optimization problems over “strictly pathwise connected domains.” Theoretical properties of the proposed discrete filled function are investigated and a solution algorithm is proposed. Numerical experiments reported in this paper on several test problems with up to 200 variables have demonstrated the applicabi...
متن کاملChapter 23 Approximate Max Cut
Given an undirected graph G = (V, E) and nonnegative weights ω i j on the edge i j ∈ E, the maximum cut problem (MAX CUT) is that of finding the set of vertices S that maximizes the weight of the edges in the cut (S , S); that is, the weight of the edges with one endpoint in S and the other in S. For simplicity, we usually set ω i j = O for i j E and denote the weight of a cut (S , S) by w(S , ...
متن کاملA Continuation Algorithm for Max-Cut Problem
A continuation algorithm for the solution of max-cut problems is proposed in this paper. Unlike the available semi-definite relaxation, a max-cut problem is converted into a continuous nonlinear programming by employing NCP functions, and the resulting nonlinear programming problem is then solved by using the augmented Lagrange penalty function method. The convergence property of the proposed a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2007.09.012